A Sequent Calculus for Automated Reasoning in Symbolic Computation Systems
نویسندگان
چکیده
منابع مشابه
Gentzen Sequent Calculus for Possibilistic Reasoning
Possibilistic logic is an important uncertainty reasoning mech anism based on Zadeh s possibility theory and classical logic The deduc tion rules of possibilistic logic have been obtained from classical resolu tion rule by attaching possibility or necessity weight to ordinary clauses However since not all possibility valued formulae can be converted into equivalent possibilistic clauses the res...
متن کاملA Sequent Calculus for Reasoning in Four-Valued Description Logics
Description Logics (DLs, for short) provide a logical reconstruction of the so-called frame-based knowledge representation languages. Originally, four-valued DLs have been proposed in order to develop expressively powerful DLs with tractable subsumption algorithms. Recently, four-valued DLs have been proposed as a model for (multimedia) document retrieval. In this context, the main reasoning ta...
متن کاملSymbolic Computation and Automated Reasoning for Program Analysis
This talk describes how a combination of symbolic computation techniques with first-order theorem proving can be used for solving some challenges of automating program analysis, in particular for generating and proving properties about the logically complex parts of software. The talk will first present how computer algebra methods, such as Gröbner basis computation, quantifier elimination and ...
متن کاملA sequent calculus for skeptical reasoning in autopeistemic logic
A sequent calculus for skeptical consequence in infinite autoepistemic theories is presented and proved sound and complete. While skeptical consequence is decidable in the finite case, the move to infinite theories increases the complexity of skeptical reasoning to being Π1-complete. This implies the need for sequent rules with countably many premises, and such rules are employed.
متن کاملA Sequent Calculus for Counterfactual Reasoning (CMU-CyLab-17-003)
Counterfactual conditions such as “if A were not true, then C would not have been true” have been formally studied by philosophers for causal claims for decades. Counterfactuals are often used informally in practice for diagnosing systems and identifying errors or misconfigurations. This paper develops a proof theory for counterfactual reasoning of Horn clauses, which have applications in domai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1995
ISSN: 0747-7171
DOI: 10.1006/jsco.1995.1011